Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Efficient storage scheme for deadline aware distributed matrix multiplication
Yongzhu ZHAO, Weidong LI, Bin TANG, Feng MEI, Wenda LU
Journal of Computer Applications    2020, 40 (2): 311-315.   DOI: 10.11772/j.issn.1001-9081.2019091640
Abstract458)   HTML15)    PDF (742KB)(543)       Save

Distributed matrix multiplication is a fundamental operation in many distributed machine learning and scientific computing applications, but its performance is greatly influenced by the stragglers commonly existed in the systems. Recently, researchers have proposed a fountain code based coded matrix multiplication method, which can effectively mitigate the effect of stragglers by fully exploiting the partial results of stragglers. However, it lacks the consideration of the storage cost of worker nodes. By considering the tradeoff relationship between the storage cost and the finish time of computation, the computational deadline-aware storage optimization problem for heterogeneous worker nodes was proposed firstly. Then, through the theoretical analysis, the solution based on expectation approximation was presented, and the problem was transformed into a convex optimization problem by relaxation for efficient solution. Simulation results show that in the case of ensuring a large task success rate, the storage overhead of the proposed scheme will rapidly decrease as the task duration is relaxed, and the scheme can greatly reduce the storage overhead brought by encoding. In other words, the proposed scheme can significantly reduce the extra storage overhead while guaranteeing that the whole computation can be finished before the deadline with high probability.

Table and Figures | Reference | Related Articles | Metrics
Feature evaluation of radar signal based on aggregation, discreteness and divisibility
DENG Yanli JIN Weidong LI Jiahui LIU Xin
Journal of Computer Applications    2013, 33 (07): 1946-1949.   DOI: 10.11772/j.issn.1001-9081.2013.07.1946
Abstract740)      PDF (801KB)(504)       Save
Quality of intrapulse feature about radar signals has proved to be a significant foundation to decide whether the signals can be differentiated effectively. For evaluating the quality quantitatively, a method adopting fuzziness and close-degree to evaluate intrapulse feature aggregation and discreteness of signals was proposed in this paper. Space distribution of intrapluse feature about radar signals was analyzed with this method, while intrapulse feature aggregation was evaluated by fuzziness and intrapulse feature discreteness was evaluated by close-degree. And for the overlapping states of feature space distribution, a linear separable measure of intrapluse feature about radar signals was put forward by within-class distance, between-class distance and linear discriminated criterion. The simulation results, based on the experiments of two intrapulse features extracted via time-frequency atom approach about five kinds of radar signal, show that the method and measure proposed in the paper are effective and feasible. It provides a new idea and approach for quantitatively evaluating features of the radar emitter signal.
Reference | Related Articles | Metrics